Fast and compact regular expression matching
نویسندگان
چکیده
منابع مشابه
Fast and compact regular expression matching
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how to improve the space and/or remove a dependency on the alphabet size for each problem using either an i...
متن کاملFast Regular Expression Matching Using FPGA
With the growing number of viruses and network attacks, Intrusion Detection Systems have to match a large set of regular expressions at multi-gigabit speed to detect malicious activities on the network. Many algorithms and architectures have been designed to accelerate pattern matching, but most of them can be used only for strings or a small set of regular expressions. The capacity of availabl...
متن کاملCompact and Fast Algorithms for Regular Expression Search
This paper describes an improvement of the brute force determinization algorithm in the case of homogeneous NFAs, as well as its application to pattern matching. Brute force determinization with limited memory may provide a partially determinized automaton, but its bounded complexity makes it be a fail-safe procedure contrary to the classical subset construction. We investigate the particular c...
متن کاملCompact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speciic properties of Glushkov's nondeterministic nite automaton (NFA) construction algorithm, we are able to encode the DFA using (m + 1)(2 m+1 + jj) bits, where m is the number of characters (excluding operator symbols) in the regular expression and is the alphabet. This compares favorably against the wors...
متن کاملFast, memory-efficient regular expression matching with NFA-OBDDs
1389-1286/$ see front matter 2011 Elsevier B.V doi:10.1016/j.comnet.2011.07.002 q This article is a revised and expanded versio appears in the 13th International Symposium on Intrusion Detection (RAID’10) [55]. ⇑ Corresponding author. Tel.: +1 732 445 2001x3 ⇑⇑ Principle corresponding author. Fax: +1 732 445 E-mail addresses: [email protected] (L. Yang edu (R. Karim), [email protected]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.08.042